Fast linear-space computations of longest common subsequences
نویسندگان
چکیده
منابع مشابه
Fast Linear-Space Computations of Longest Common Subsequences
Space saving techniques in computations of a longest common subsequence (LCS) of two strings are crucial in many applications, notably, in molecular sequence comparisons. For about ten years, however, the only linear-space LCS algorithm known required time quadratic in the length of the input. for all inputs. This paper reviews linear-space LCS computations in connection with two classical para...
متن کاملSimple and fast linear space computation of longest common subsequences
Given two sequences A = a1a2 . . . am and B = b1b2 . . . bn, m 6 n, over some alphabet Σ of size s the longest common subsequence (LCS) problem is to find a sequence of greatest possible length that can be obtained from both A and B by deleting zero or more (not necessarily adjacent) symbols. Applications for the LCS problem arise in many different areas since the length, p, of a longest common...
متن کاملLongest Common Subsequences
The length of a longest common subsequence (LLCS) of two or more strings is a useful measure of their similarity. The LLCS of a pair of strings is related to thèedit distance', or number of mu-tations/errors/editing steps required in passing from one string to the other. In this talk, we explore some of the combinatorial properties of the sub-and super-sequence relations, survey various algorit...
متن کاملFast and Simple Computation of All Longest Common Subsequences
This paper shows that a simple algorithm produces the all-prefixes-LCSs-graph in O(mn) time for two input sequences of size m and n. Given any prefix p of the first input sequence and any prefix q of the second input sequence, all longest common subsequences (LCSs) of p and q can be generated in time proportional to the output size, once the all-prefixes-LCSs-graph has been constructed. The pro...
متن کاملA Fast Algorithm for Computing Longest Common Subsequences
References 1. Benner, F.H. On designing generalized file records for management information systems. Proc. AFIPS 1967 FJCC, Vol. 31, AFIPS Press, Montvale, N.J., pp. 291-303. 2. Burroughs DISK FORTE Users Manual. Burroughs Corp., Detroit, Mich., 1973. 3. Collmeyer, A.J., and Shemer, J.E. Analysis of retrieval performance for selected file organization techniques. Proc. AFIPS 1970 FJCC, Vol. 37,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90132-y